Scheduling with Bully Selfish Jobs

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling with Incompatible Jobs

We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time. the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structu...

متن کامل

Selfish Scheduling with Setup Times

We study multiprocessor scheduling games with setup times on identical machines. Given a set of scheduling policies (coordination mechanism) on the machines, each out of n players chooses a machine to assign his owned job to, so as to minimize his individual completion time. Each job has a processing length and is of a certain type. Same-type jobs incur a setup overhead to the machine they are ...

متن کامل

Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...

متن کامل

Scheduling Adaptively Parallel Jobs Scheduling Adaptively Parallel Jobs

An adaptively parallel job is one in which the number of processors which can be used without waste changes during execution. When allocating processors to multiple adap-tively parallel jobs, a job scheduler should attempt to be fair|meaning that no job gets fewer processors than another, unless it demands fewer|and eecient|meaning that the scheduler does not waste processors on jobs that do no...

متن کامل

Mechanisms for scheduling games with selfish players

Acknowledgments A Ph.D. thesis is the product of several years of work and, therefore, influenced by a lot of people. Here I would like to thank all of you who contributed, in one way or another, to me being able to finish this work. The following people deserve a special mention. First of all I thank Marc Uetz for the supervision during this trajectory. Starting with the final project of my ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2011

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-011-9336-5